Boundary block-searching algorithm for arbitrary shaped coding
نویسندگان
چکیده
منابع مشابه
Boundary block-searching algorithm for arbitrary shaped coding
Arbitrary shaped coding is an important issue of MPEG-4. In this study, an efficient shaped coding method, called the boundary block-searching (BBS) algorithm that can enhance the coding efficiency of conventional padding schemes, is proposed. The proposed BBS algorithm assumes that boundary blocks have strong correlation even though they are not connected. For an input boundary block, the most...
متن کاملImpact of Similarity Threshold on Arbitrary Shaped Pattern Selection Very Low Bit-Rate Video Coding Algorithm
Very low bit-rate video coding using arbitrary shaped patterns to represent moving regions in macroblocks has very good potential for improved coding efficiency. For any pattern based coding similarity threshold is used as a matching criterion between a moving region and a pattern. This metric together with quantization can control the coding efficiency curve. Unlike the quantization step size,...
متن کاملVery Low Bit-Rate Video Coding using an Extended Arbitrary-Shaped Pattern Selection Algorithm
Very low bit-rate video coding using patterns to represent moving regions in macroblocks exhibits good potential for improved coding efficiency. Recently an Arbitrary Shaped Pattern Selection (ASPS) algorithm was presented, that used a dynamically extracted set of same sized patterns, which were based on actual video content. This algorithm however, like other pattern matching algorithms failed...
متن کاملA Distance-Based Block Searching Algorithm
We present in this paper an algorithm for the multiple comparison of a set of protein sequences. Our approach is that of peptide matching and consists in looking for all the words that occur approximatively in at least q of the sequences in the set, where q is a parameter. Words are compared by using a reference object called a model, that is itself a word over the alphabet of the amino acids, ...
متن کاملEfficient Differential Trail Searching Algorithm for ARX Block Ciphers
In this paper, we suggest an advanced method searching for differential trails of block cipher with ARX structure. We use two techniques to optimize the automatic search algorithm of differential trails suggested by Biryukov et al. and obtain 2~3 times faster results than the previous one when implemented in block cipher SPECK.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optical Engineering
سال: 2005
ISSN: 0091-3286
DOI: 10.1117/1.2013268